2

On the cost of approximating all roots of a complex polynomial

Year:
1985
Language:
english
File:
PDF, 656 KB
english, 1985
3

A Mathematical View of Interior-Point Methods in Convex Optimization || Back Matter

Year:
2001
Language:
english
File:
PDF, 49 KB
english, 2001
4

Some perturbation theory for linear programming

Year:
1994
Language:
english
File:
PDF, 945 KB
english, 1994
5

A polynomial-time algorithm, based on Newton's method, for linear programming

Year:
1988
Language:
english
File:
PDF, 1.46 MB
english, 1988
6

Condition Numbers, the Barrier Method, and the Conjugate-Gradient Method

Year:
1996
Language:
english
File:
PDF, 2.67 MB
english, 1996
8

Linear programming, complexity theory and elementary functional analysis

Year:
1995
Language:
english
File:
PDF, 3.34 MB
english, 1995
9

Hyperbolic Programs, and Their Derivative Relaxations

Year:
2006
Language:
english
File:
PDF, 254 KB
english, 2006
12

Foreword

Year:
2005
Language:
english
File:
PDF, 106 KB
english, 2005
13

On the worst-case arithmetic complexity of approximating zeros of polynomials

Year:
1987
Language:
english
File:
PDF, 1.30 MB
english, 1987
16

Foreword

Year:
2015
Language:
english
File:
PDF, 196 KB
english, 2015
17

A Mathematical View of Interior-Point Methods in Convex Optimization || 1. Preliminaries

Year:
2001
Language:
english
File:
PDF, 142 KB
english, 2001
18

On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae

Year:
1992
Language:
english
File:
PDF, 2.21 MB
english, 1992
20

Unified complexity analysis for Newton LP methods

Year:
1992
Language:
english
File:
PDF, 803 KB
english, 1992
21

Accelerated first-order methods for hyperbolic programming

Year:
2017
Language:
english
File:
PDF, 618 KB
english, 2017
22

Incorporating Condition Measures into the Complexity Theory of Linear Programming

Year:
1995
Language:
english
File:
PDF, 1.67 MB
english, 1995
24

On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials

Year:
1989
Language:
english
File:
PDF, 2.11 MB
english, 1989
25

Rudiments of an average case complexity theory for piecewise-linear path following algorithms

Year:
1988
Language:
english
File:
PDF, 2.09 MB
english, 1988
27

Central Swaths

Year:
2013
Language:
english
File:
PDF, 1.39 MB
english, 2013
28

A Mathematical View of Interior-Point Methods in Convex Optimization || Front Matter

Year:
2001
Language:
english
File:
PDF, 64 KB
english, 2001
30

``Efficient” Subgradient Methods for General Convex Optimization

Year:
2016
Language:
english
File:
PDF, 504 KB
english, 2016